The obnoxious enter problem on a tree
نویسنده
چکیده
منابع مشابه
An efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملThe Obnoxious Center Problem on a Tree
The obnoxious center problem in a graph G asks for a location on an edge of the graph such that the minimum weighted distance from this point to a vertex of the graph is as large as possible. We derive algorithms with linear running time for the cases when G is a path or a star, thus improving previous results of Tamir. For subdivided stars we present an algorithm of running time O(n log n). Fo...
متن کاملObnoxious p-Median problems: valid inequalities and a Branch-and-Cut approach
The Obnoxious p-Median (OpM) problem is the repulsive counterpart of the more known attractive pmedian problem: given a set C of cities and a set F of possible locations for obnoxious plants, it consists in finding a p-cardinality subset of F , such that the sum of the distances between each city of C and the nearest site is maximised. Two alternative formulations for OpM and the proof of its N...
متن کاملAlgorithm for Obnoxious Facility Location Problem
This study presents an endeavor to determine an optimal solution for the obnoxious facility location problem. Obnoxious materials are those which may cause harm to the health of human beings and pollute the environment. The obnoxious material management is a significant environmental issue. Since the social economical growth encourages to establishment of industrialization. While the waste mate...
متن کاملAntibandwidth of complete k-ary trees
The antibandwidth problem is to label vertices of a n-vertex graph injectively by 1, 2, 3, . . . n, so that the minimum difference between labels of adjacent vertices is maximised. The problem is motivated by the obnoxious facility location problem, radiocolouring, work and game scheduling and is dual to the well known bandwidth problem. We prove exact results for the antibandwidth of complete ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001